Enabling the Application of Open Systems like PCs for Online Voting
نویسندگان
چکیده
An increasing number of elections have been performed using Online Voting. Due to these experiences, the technical research topics have changed: While voting protocols have been well analysed in the past, now, the security and trustworthiness of the client platforms come to the fore. Malware could cause arbitrary damages regardless how secure the underlying voting scheme is. Moreover, corrupt voters can overcome the receipt-freeness of many protocols by manipulating their voting client (PC). Currently, the client side is mainly protected by organizational measures imposed on the voters, largely ignoring the issue of corrupt voters. However, since elections are the very basis of democracy, verifiable technical solutions are essential. Therefore, we examine the necessary properties of a trustworthy client which both protect the voters from malware and the voting system from corrupt voters. Our approach is based on Trusted Computing in combination with a secure operating system. We show that other existing voting protocols can be implemented on the top of our approach as well as a significantly simplified voting scheme by still retaining the required properties.
منابع مشابه
Voting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملTransparent, Auditable, and Stepwise Verifiable Online E-Voting Enabling an Open and Fair Election
Many e-voting techniques have been proposed but not widely used in reality. One of the problems associated with most existing e-voting techniques is the lack of transparency, leading to a failure to deliver voter assurance. In this work, we propose a transparent, auditable, stepwise verifiable, viewable, and mutual restraining e-voting protocol that exploits the existing multi-party political d...
متن کاملMultiple Casts in Online Voting: Analyzing Chances
We analyze multiple casts as an easy and non-technical approach to overcome some of the open questions and risks of online voting. The mechanism of multiple casts can be added to almost all existing online voting systems. Nevertheless, there are also some disadvantages, for instance the validity of a timestamp, which are discussed in the paper as well.
متن کاملVoting and different ranking orders in DEA
Data Envelopment Analysis (DEA) technique now widely use for efficiency evaluation of a set of Decision Making Units (DMUs). As regards of the necessity for ranking efficient units different DEA models presented each of which has advantages and rank efficient units from special aspects. Note that all the existing ranking models have disadvantages, as well and there is not a model in which all t...
متن کامل